Ordered Semantic Hyper LinkingDavid

نویسنده

  • David A. Plaisted
چکیده

In this paper, we present a novel rst order theorem proving strategy { ordered semantic hyper linking. Ordered semantic hyper linking (OSHL) is an instance-based refutational theorem proving strategy. It is sound and complete. OSHL has an eecient propositional decision procedure. It solves rst order problems by reducing them to propositional problems. It uses natural semantics of an input problem to guide its search. It also incorporates term rewriting to handle equality. The propositional eeciency, semantic guidance and equality support allow OSHL to solve problems that are diicult for many other strategies. The eeciency of OSHL is supported by experimental study as well as complexity analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integrating Information on the Semantic Web Using Partially

The semantic web is supposed to be a global, machine-readable information repository, but there is no agreement on a single common information metamodel. To prevent the fragmentation of this nascent semantic web, this thesis introduces the expressive and flexible Braque metamodel. Based on non-well-founded partially ordered multisets (hyper pomsets), augment with a powerful reflection mechanism...

متن کامل

Bipolar Fuzzy Structures of Some Types of Ideals in Hyper Bck-algebras

Using the notion of bipolar-valued fuzzy sets, the concepts of bipolar fuzzy (weak, s-weak, strong) hyper BCK-ideals are introduced, and their relations are discussed in [3]. Further properties are investigated in this article. We show that if Φ = (H ;μΦ , μ N Φ ) is a bipolar fuzzy (weak, strong) hyper BCK-ideal of a hyper BCK-algebra H, then the set I := {x ∈ H | μΦ(x) = μΦ(0), μΦ (x) = μΦ (0...

متن کامل

Archimedean - like Classes of Lattice - Ordered Groups

Suppose <? denotes a class of totally ordered groups closed under taking subgroups and quotients by o-homomorphisms. We study the following classes: (1) Res (£?), the class of all lattice-ordered groups which are subdirect products of groups in C; (2) Hyp(C), the class of lattice-ordered groups in Res(C) having all their ¿-homomorphic images in Res(<?); Para(C), the class of lattice-ordered gro...

متن کامل

A QoS-Aware Hyper-graph Based Method of Semantic Service Composition

Semantic service composition is an important issue in web service based systems. It is about how to build a new, reusable and value-added service by combining existing semantic web services. In this paper we propose a new hyper-graph based method supporting semantic service composition, which model the service composition problem as a hyper-graph. Then the hyper-graph based service composition ...

متن کامل

Rough Resolution: A Refinement of Resolution

Semantic hyper-linking [Plaisted et al., 1992, Chu and Plaisted, 1993, Chu and Plaisted, 19921 has been proposed recently to use semantics with hyper-linking [Lee and Plaisted, 19921, an instance-based theorem proving technique. Ground instances are generated until an unsatisfiable ground set is obtained; semantics is used to greatly reduce the search space. One disadvantage of semantic hyper-l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997